Average long-lived binary consensus: Quantifying the stabilizing role played by memory
نویسندگان
چکیده
منابع مشابه
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a binary value produced by the i-th sensor. The sequence of input vectors is assumed to be smooth: exactly one entry of the vector changes from one round to the next one. The system implements a fault-tolerant averaging consensus f...
متن کاملAverage Binary Long-Lived Consensus and the Stabilizing Role Played by Memory
Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a binary value produced by the i-th sensor. The sequence of input vectors is assumed to be smooth: exactly one entry of the vector changes from one round to the next one. The system implements a faulttolerant averaging consensus fu...
متن کاملAverage Long-Lived Memoryless Consensus: The Three-Value Case
We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes over a random walk sequence of input vectors (where each component of the vector corresponds to a particular sensor reading). We analyze the case where each sensor can read three possible inputs. The proof of this result appears ...
متن کاملGeodesic stability for memoryless binary long-lived consensus
The determination of the stability of the long-lived consensus problem is a fundamental open problem in distributed systems. We concentrate on the memoryless binary case with geodesic paths. We offer a conjecture on the stability in this case, exhibit two classes of colourings which attain this conjectured bound, and improve the known lower bounds for all colourings. We also introduce a related...
متن کاملStability of long-lived consensus
This paper introdu es the notion of stability for a longlived onsensus system. This notion re e ts how sensitive to hanges the de isions of the system are, from one invoation of the onsensus algorithm to the next, with respe t to input hanges. Stable long-lived onsensus systems are proposed, and tight lower bounds on the a hievable stability are proved, for several di erent s enarios. The s ena...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.01.005